Computer Arithmetic Based on Continued Logarithms

نویسندگان

  • Tomáš Brabec
  • Róbert Lórencz
چکیده

The paper deals with efficient hardware implementation of exact arithmetic. This kind of arithmetic represents the most convenient approach to scientific computing, but the complexity of underlying algorithms and thus the performance issues limit the set of solvable problems. We demonstrate on a particular example of continued logarithms that direct hardware implementation may help to achieve considerable performance gains. We document this fact by practical results of our research and use them as a starting point for discussion on possible directions of further work.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Continued Logarithms and Associated Continued Fractions

We investigate some of the connections between continued fractions and continued logarithms. We study the binary continued logarithms as introduced by Bill Gosper and explore two generalizations of the continued logarithm to base b. We show convergence for them using equivalent forms of their corresponding continued fractions. Through numerical experimentation we discover that, for one such for...

متن کامل

On Progress of Investigations in Continued Logarithm Arithmetic

This is a work-in-progress on research of exact real arithmetic using continued fraction paradigm. We introduce a new redundant extension of continued logarithm representation, which offers the lacking real number computability. In a uniform way, we contrast this new representation with existing alternatives and using few examples we discuss their practical aspects. It follows from this compari...

متن کامل

Generalized Continued Logarithms and Related Continued Fractions

We study continued logarithms as introduced by Bill Gosper and studied by J. Borwein et. al.. After providing an overview of the type I and type II generalizations of binary continued logarithms introduced by Borwein et. al., we focus on a new generalization to an arbitrary integer base b. We show that all of our so-called type III continued logarithms converge and all rational numbers have fin...

متن کامل

A Low Power Full Adder Cell based on Carbon Nanotube FET for Arithmetic Units

In this paper, a full adder cell based on majority function using Carbon-Nanotube Field-Effect Transistor (CNFET) technology is presented. CNFETs possess considerable features that lead to their wide usage in digital circuits design. For the design of the cell input capacitors and inverters are used. These kinds of design method cause a high degree of regularity and simplicity. The proposed des...

متن کامل

A Radix-10 BKM Algorithm for Computing Transcendentals on Pocket Computers

We present a radix-10 variant of the BKM algorithm. It is a shift-and-add, CORDIC-like algorithm that allows fast computation of complex exponentials and logarithms. This radix-10 version is suitable for implementation in a pocket computer. Key-words: Elementary functions, CORDIC algorithms, Computer Arithmetic, radix10 arithmetic

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006